Extracting symbolic transitions from TLA+ specifications
نویسندگان
چکیده
منابع مشابه
Model Checking TLA+ Specifications
TLA is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full first-order logic and ZF set theory. TLC is a new model checker for debugging a TLA specification by checking invariance properties of a finite-state model of the specification. It accepts a subclass of TLA specifications that should include most descriptions of real system designs...
متن کاملAnimating TLA Specifications
TLA (the Temporal Logic of Actions) is a linear temporal logic for specifying and reasoning about reactive systems. We define a subset of TLA whose formulas are amenable to validation by animation, with the intent to facilitate the communication between domain and solution experts in the design of reactive systems.
متن کاملFrom Durational Specifications to TLA Designs of Timed Automata
Different temporal logics tend to emphasise different aspects of a hybrid system. In this paper, we study the predicative interpretation of Duration Calculus (DC) and Temporal Logic of Actions (TLA) and the link between them. A notation called generic composition is used to simplify the manipulation of predicates. The modalities of possibility and necessity become generic composition and its in...
متن کاملAutomatically Extracting Requirements Specifications from Natural Language
Natural language (supplemented with diagrams and some mathematical notations) is convenient for succinct communication of technical descriptions between the various stakeholders (e.g., customers, designers, implementers) involved in the design of software systems. However, natural language descriptions can be informal, incomplete, imprecise and ambiguous, and cannot be processed easily by desig...
متن کاملTeaching Transition Systems and Formal Specifications with TLA
We present here our experience with teaching two courses using TLA. The first course concerns state transition systems, and the second one is about formal specifications. In the first course, TLA is used to describe, reason about, and analyze transition systems. The second course deals with refinement, simulation and bisimulation, and TLA is used to check refinements.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2020
ISSN: 0167-6423
DOI: 10.1016/j.scico.2019.102361